gener pattern model mine binari dataset mine top dk pattern binari dataset presenc nois mine home public dresourc comput framework distribut data mine build web dscale imag similar search system right protect trajectori dataset nearest dneighbor preserv cach content dbase queri robust effici imag retriev cach algorithm similar search cophir test collect content dbase imag retriev constraint dbase queri system exploratori pattern discoveri embed retriev privat metadata electrocardiogram workshop larg dscale distribut system inform retriev lsd dir ownership protect shape dataset geodes distanc preserv right protect trajectori dataset metric cach similar search similar search metric space gener paradigm applic field effect exploit content base imag retriev system shift target web scale dimens context import issu design scalabl solut combin parallel distribut architectur cach level end investig design similar cach work metric space answer exact approxim result exact match present cach cach return approxim result set qualiti guarante conduct test collect million high qualiti digit photo show propos cach techniqu signific impact perform cach text queri prove effect tradit web search engin special track engin larg dscale distribut system editori messag crawl index similar search imag web parallel mine frequent close pattern har modern comput architectur mine queri log optim index partit parallel web search engin conquest constraint dbase queri system exploratori pattern discoveri interact pattern mine relat databas cluster import tool data mine identifi major pattern trend supervis label data privaci preserv web recommend system mine frequent close itemset dof dcore interact pattern mine relat databas cluster import tool data mine identifi major pattern trend supervis label data condens represent constrain frequent pattern push tougher constraint frequent pattern mine paper extend state art constraint push frequent pattern comput introduc class tough constraint loos anti monoton constraint deepli character show superclass convert anti monoton constraint constraint averag median model tougher constraint varianc standard deviat studi show constraint exploit levelwis apriori comput mean datareduct strategi outperform previou algorithm tough constraint exploit tougher effect dci close fast memori effici algorithm mine frequent close itemset main problem rais frequent close itemset mine problem duplic detect paper propos gener techniqu promptli detect discard duplic close itemset keep main memori set close pattern approach exploit substanti perform benefit algorithm adopt vertic represent dataset implement techniqu depth close itemset mine algorithm experiment evalu demonstr algorithm outperform state art algorithm closet fpclose webdoc real dlife huge transact dataset kdci direct count iter close constrain frequent pattern mine constrain frequent pattern close frequent pattern paradigm aim reduc set extract pattern smaller interest subset lot work paradigm confus mine problem obtain join close constrain frequent pattern uniqu framework paper shed light problem provid formal definit character studi comput issu show combin recent result paradigm provid effici algorithm exploit requir satisfi constraint close mine time order reduc comput kdci multi dstrategi algorithm mine frequent set introduct result global experi coffe break panel session session chair tba fast apriori implement ferenc bodon effici implement apriori eclat christian borgelt 